Special Issue on Exact and Heuristic Scheduling Algorithms

Heuristic and exact algorithms for Generalized Bin Covering Problem

In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.

Heuristic and exact algorithms for scheduling aircraft landings

The problem of scheduling aircraft landings on one or more runways is an interesting problem that is similar to a machine job scheduling problem with sequence-dependent processing times and with earliness and tardiness penalties. The aim is to optimally land a set of planes on one or several runways in such a way that separation criteria between all pairs of planes (not just successive ones) ar...

Exact and Heuristic Algorithms for Thrift Cyclic Scheduling

Non-preemptive schedulers, despite their many discussed drawbacks, remain a very popular choice for practitioners of real-time and embedded systems. The non-preemptive ‘thrift’ cyclic scheduler—variations of which can be found in other application areas—has recently received considerable attention for the implementation of such embedded systems. A thrift scheduler provides a flexible and compac...

Special Issue on Ant Algorithms

Introduction to the special issue: evolutionary algorithms for scheduling.

Scheduling is a problem that occurs in a large variety of forms with huge cumulative economic and social consequences. Proper scheduling can provide better utilization of scarce and expensive resources as well as higher satisfaction for individuals such as customers and employees. For this reason, there has been a lot of effort expended over a large number of years on algorithms for automatic s...